Performance of Batch-Based Digital Signatures

نویسندگان

  • William C. Cheng
  • Cheng-Fu Chou
  • Leana Golubchik
چکیده

A Digital Signature is an important type of authentication in a public-key (or asymmetric) cryptographic system, and it is in wide use. The performance of an Internet server computing digital signatures online is limited by the high cost of modular arithmetic. One simple way to improve the performance of the server is to reduce the number of computed digital signatures by combining a set of documents into a batch in a smart way and signing each batch only once. This reduces the demand on the CPU but requires extra information to be sent to clients. In this paper, we investigate performance characteristics of online digital signature batching schemes. We give a semi-Markov model of a gated batch-based digital signature server and its approximate solution. We validate the solutions of the analytical model through both emulation and simulation. Our study shows that significant computational benefits can be obtained from batching without significant increases in the amount of additional information that needs to be sent to the clients.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Identification of Multiple Invalid Pairing-Based Signatures in Constrained Batches

This paper describes a new method in pairing-based signature schemes for identifying the invalid digital signatures in a batch after batch verification has failed. The method more efficiently identifies non-trivial numbers, w, of invalid signatures in constrained sized, N , batches than previously published methods, and does not require that the verifier possess detailed knowledge of w. Our met...

متن کامل

Identification of Multiple Invalid Signatures in Pairing-Based Batched Signatures

This paper describes new methods in pairing-based signature schemes for identifying the invalid digital signatures in a batch, after batch verification has failed. These methods efficiently identify non-trivial numbers of invalid signatures in batches of (potentially large) numbers of signatures. Our methods use “divide-and-conquer” search to identify the invalid signatures within a batch, but ...

متن کامل

An Efficient Batch Verifying Scheme for Detecting Illegal Signatures

In a batch verifying scheme, multiple RSA digital signatures can be verified simultaneously in just one exponential operation time. Currently, the verifier could not easily detect where the signature-verification fault was located in most schemes, if the batch verification fails. In this article, we proposed a new batch verifying multiple RSA digital signatures scheme based on a cube. The schem...

متن کامل

Research Issues and Challenges for Multiple Digital Signatures

In this paper, we surveyed several well-known batch verification multiple digital signatures. These schemes can batch verify multiple digital signatures which need only one verification instead of t verifications. However, a number of weaknesses of these schemes are pointed out. According to our proposed issues and challenges, we compared and analyzed them. To sum up these schemes, a secure and...

متن کامل

Efficient Identification of Bad Signatures in RSA-Type Batch Signature

As the use of electronic voting systems and e-commerce systems increases, the efficient batch verification of digital signatures becomes more and more important. In this paper, we first propose a new method to identify bad signatures in batches efficiently for the case when the batch contains one bad signature. The method can find out the bad signature using smaller number of modular multiplica...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002